A Comparative Study of Block Incomplete Sparse Approximate Inverses Preconditioning on Tesla K20 and V100 GPUs
نویسندگان
چکیده
منابع مشابه
Parallel Preconditioning with Sparse Approximate Inverses
A parallel preconditioner is presented for the solution of general sparse linear systems of equations. A sparse approximate inverse is computed explicitly and then applied as a preconditioner to an iterative method. The computation of the preconditioner is inherently parallel, and its application only requires a matrix-vector product. The sparsity pattern of the approximate inverse is not impos...
متن کاملA New Approach to Parallel Preconditioning with Sparse Approximate Inverses
A new parallel preconditioner is presented for the solution of large, sparse, nonsymmetric linear systems of equations. A sparse approximate inverse is computed explicitly, and then applied as a precondi-tioner to an iterative method. The computation of the preconditioner is inherently parallel, and its application only requires a matrix-vector product. The sparsity pattern of the approximate i...
متن کاملSparse Approximate Inverses for Preconditioning of Linear Equations
1. Sparse Approximate Inverses and Linear Equations We consider the problem of solving a system of linear equations Ax = b in a parallel environment. Here, the n n-matrix A is large, sparse, unstructured, nonsymmetric, and ill-conditioned. The solution method should be robust, easy to parallelize, and applicable as a black box solver. Direct solution methods like the Gaussian Elimination are no...
متن کاملModified Sparse Approximate Inverses (MSPAI) for Parallel Preconditioning
The solution of large sparse and ill-conditioned systems of linear equations is a central task in numerical linear algebra. Such systems arise from many applications like the discretization of partial differential equations or image restoration. Herefore, Gaussian elimination or other classical direct solvers can not be used since the dimension of the underlying coefficient matrices is too larg...
متن کاملApproximate Inverses and Incomplete Decompositions
In this work we consider the approximate inverse preconditioners AISM based on the Sherman-Morrison formula [1]. We will show some of theoretical properties of the factors of AISM in function of the value of parameter s considered in the decomposition. In particular, we will show that one of the factors hides a scaled factor of the standard incomplete LDU decomposition of the system matrix A. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2021
ISSN: 1999-4893
DOI: 10.3390/a14070204